An Approach to Optimizing Adaptive Parabolic PDE Solvers for the Grid
نویسندگان
چکیده
control strategies for these codes. We have developed a parameterizable benchmark called MOL that captures a wide range of realistic Method-of-Lines codes. We are using this benchmark to develop performance models that can be used to achieve specific optimality criteria under the available (and
منابع مشابه
Spacetree-Based Adaptive Mesh Refinement for Hyperbolic Partial Differential Equations
Adaptive mesh refinement (AMR) is a state-of-the-art technique for the efficient numerical solution of partial differential equations (PDE) exhibiting multiple widely differing spatial scales. Recently, spacetree-based AMR has been established as a promising approach to structured AMR (see for example [1]). In the talk the integration of the two software modules PyClaw [2] and Peano [4] is pres...
متن کاملAdaptive Multilevel Trust-Region Methods for Time-Dependent PDE-Constrained Optimization
We present a class of adaptive multilevel trust-region methods for the efficient solution of optimization problems governed by time–dependent nonlinear partial differential equations with control constraints. The algorithm is based on the ideas of the adaptive multilevel inexact SQP-method from [26, 27]. It is in particular well suited for problems with time–dependent PDE constraints. Instead o...
متن کاملA Newton-picard Approach for Efficient Numerical Solution of Time-periodic Parabolic Pde Constrained Optimization Problems
We investigate an iterative method for the solution of time-periodic parabolic PDE constrained optimization problems. It is an inexact Sequential Quadratic Programming (iSQP) method based on the Newton-Picard approach. We present and analyze a linear quadratic model problem and prove optimal mesh-independent convergence rates. Additionally, we propose a two-grid variant of the Newton-Picard met...
متن کاملDynamic load-balancing for PDE solvers on adaptive unstructured meshes
Modern PDE solvers written for time-dependent problems increasingly employ adaptive unstructured meshes (see Flaherty et al. [4]) in order to both increase e ciency and control the numerical error. If a distributed memory parallel computer is to be used, there arises the signi cant problem of dividing up the domain equally amongst the processors whilst minimising the intersubdomain dependencies...
متن کاملDynamic Load-Balancing For PDE Solvers Using Adaptive Unstructured Meshes
Modern PDE solvers written for time-dependent problems increasingly employ adaptive unstructured meshes (see Flaherty et al. [4]) in order to both increase e ciency and control the numerical error. If a distributed memory parallel computer is to be used, there arises the signi cant problem of dividing up the domain equally amongst the processors whilst minimising the intersubdomain dependencies...
متن کامل